Randomized Group-Greedy Method for Large-Scale Sensor Selection Problems
نویسندگان
چکیده
The randomized group-greedy (RGG) method and its customized for large-scale sensor selection problems are proposed. greedy algorithm is applied straightforwardly to the (GG) method, a also considered. In part of compressed candidates selected using common or other low-cost methods. This strategy compensates deterioration solution due candidates. proposed methods implemented based on D- E-optimal design experiments, numerical experiments conducted randomly generated candidate matrices with potential locations 10000–1000000. can provide better optimization results than those obtained by original GG when similar computational cost spent as method. because group size be increased result algorithm. Similar were in real dataset. effective E-optimality criterion, which objective function that difficult absence submodularity function. idea present improve performance all optimizations
منابع مشابه
A Randomized Greedy Algorithm for Near-Optimal Sensor Scheduling in Large-Scale Sensor Networks
We study the problem of scheduling sensors in a resource-constrained linear dynamical system, where the objective is to select a small subset of sensors from a large network to perform the state estimation task. We formulate this problem as the maximization of a monotone set function under a matroid constraint. We propose a randomized greedy algorithm that is significantly faster than state-of-...
متن کاملLarge-scale Submodular Greedy Exemplar Selection with Structured Similarity Matrices
Exemplar clustering attempts to find a subset of data-points that summarizes the entire data-set in the sense of minimizing the sum of distances from each point to its closest exemplar. It has many important applications in machine learning including document and video summarization, data compression, scalability of kernel methods and Gaussian processes, active learning and feature selection. A...
متن کاملGroup-Based Secure Communication for Large- Scale Wireless Sensor Networks
Achieving security in resource-constrained wireless sensor networks is a challenging research task. Many key management schemes have been developed recently to provide secure communication between source and destination in wireless sensor networks. A serious threat highlighted in all of these schemes is that of node capture attacks, where an adversary gains full control over a sensor node throu...
متن کاملRegularization with Randomized SVD for Large-Scale Discrete Inverse Problems
In this paper we propose an algorithm for solving the large-scale discrete ill-conditioned linear problems arising from the discretization of linear or nonlinear inverse problems. The algorithm combines some existing regularization techniques and regularization parameter choice rules with a randomized singular value decomposition (SVD) so that only much smaller-scale systems are needed to solve...
متن کاملRandomized Algorithms for Solving Large Scale Nonlinear Least Squares Problems
This thesis presents key contributions towards devising highly efficient stochastic reconstruction algorithms for solving large scale inverse problems, where a large data set is available and the underlying physical systems is complex, e.g., modeled by partial differential equations (PDEs). We begin by developing stochastic and deterministic dimensionality reduction methods to transform the ori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Sensors Journal
سال: 2023
ISSN: ['1558-1748', '1530-437X']
DOI: https://doi.org/10.1109/jsen.2023.3258223